package searchInsert;

public class Solution {
    public int searchInsert(int[] nums, int target) {
        return binartSearch(nums,target);
    }
    private int binartSearch(int[] nums,int target) {
        int l = 0,r = nums.length-1;
        while (l<=r) {
            int mid = l + (r-l)/2;
            if(nums[mid]>target) {
                r = mid-1;
            }else if(nums[mid] < target) {
                l = mid+1;
            }else {
                return mid;
            }
        }
        return l;
    }
}
